Access Paths for Data Mining Query Optimizer
نویسندگان
چکیده
Data mining research has developed many pattern discovery algorithms dedicated to specific data and pattern characteristics. We argue that a user should not be responsible for choosing the most efficient algorithm to solve a particular data mining problem. Instead, a data mining query optimizer should follow the cost-based optimization techniques to select an appropriate algorithm to solve the user's problem. In this paper we discuss the process of data mining query optimization and we extend the list of choices the optimizer can make.
منابع مشابه
Data Access Paths for Frequent Itemsets Discovery
Many frequent itemset discovery algorithms have been proposed in the area of data mining research. The algorithms exhibit significant computational complexity, resulting in long processing times. Their performance is also dependent on source data characteristics. We argue that users should not be responsible for choosing the most efficient algorithm to solve a particular data mining problem. In...
متن کاملJoins based on the Access Path Model for Crowdsourced Databases by Lynn
Integrating the crowd into established systems such as traditional relational databases poses new challenges to the design of a query optimizer. Not only the latency has to be considered, but also monetary costs and the accuracy of results. To achieve a better quality of the final answer, more money is needed to reward the workers. This problem apparently asks for trade-off solutions dependent ...
متن کاملQuery Optimizer Model for Performance Enhancement of Data Mining Based Query
In present scenario almost applications are built upon data mining & OLAP tools and allow Users to answer information requests based on a data warehouse. that is managed by a powerful RDBMS. This paper is focused on query optimization technique which generates sequences of SQL statements in order to produce the requested information. The analysis for this paper is exposed that many sequences of...
متن کاملHorton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs
Horton+ is a graph query processing system that executes declarative reachability queries on a partitioned attributed multi-graph. It employs a query language, query optimizer, and a distributed execution engine. The query language expresses declarative reachability queries, and supports closures and predicates on node and edge attributes to match graph paths. We introduce three algebraic opera...
متن کاملModParOpt: A Modular Query Optimizer for Multi-Query Parallel Databases
This paper presents MODPAROPT, MODular PARallel Query OPTimizer) a parallel optimizer for complex relational queries in a multi-query environment, which meets perfectly the requirements of modern database applications (e.g. decision support and data mining). The optimizers architecture was developed in a very strict modular way being therefore highly extensible. It integrates an intelligent res...
متن کامل